Welcome to the InfoSci Platform
Reference Hub1
Proposal of Iterative Genetic Algorithm for Test Suite Generation

Proposal of Iterative Genetic Algorithm for Test Suite Generation

Ankita Bansal, Abha Jain, Abhijeet Anand, Swatantra Annk
Copyright: © 2021 |Volume: 12 |Issue: 1 |Pages: 20
ISSN: 1947-8186|EISSN: 1947-8194|EISBN13: 9781799861508|DOI: 10.4018/IJISMD.2021010106
Cite Article Cite Article

MLA

Bansal, Ankita, et al. "Proposal of Iterative Genetic Algorithm for Test Suite Generation." IJISMD vol.12, no.1 2021: pp.111-130. http://doi.org/10.4018/IJISMD.2021010106

APA

Bansal, A., Jain, A., Anand, A., & Annk, S. (2021). Proposal of Iterative Genetic Algorithm for Test Suite Generation. International Journal of Information System Modeling and Design (IJISMD), 12(1), 111-130. http://doi.org/10.4018/IJISMD.2021010106

Chicago

Bansal, Ankita, et al. "Proposal of Iterative Genetic Algorithm for Test Suite Generation," International Journal of Information System Modeling and Design (IJISMD) 12, no.1: 111-130. http://doi.org/10.4018/IJISMD.2021010106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Huge and reputed software industries are expected to deliver quality products. However, industry suffers from a loss of approximately $500 billion due to shoddy software quality. The quality of the product in terms of its accuracy, efficiency, and reliability can be revamped through testing by focusing attention on testing the product through effective test case generation and prioritization. The authors have proposed a test-case generation technique based on iterative listener genetic algorithm that generates test cases automatically. The proposed technique uses its adaptive nature and solves the issues like redundant test cases, inefficient test coverage percentage, high execution time, and increased computation complexity by maintaining the diversity of the population which will decrease the redundancy in test cases. The performance of the technique is compared with four existing test-case generation algorithms in terms of computational complexity, execution time, coverage, and it is observed that the proposed technique outperformed.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.